Yangian-invariant spin models and Fibonacci numbers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy of Graphs, Matroids and Fibonacci Numbers

The energy E(G) of a graph G is the sum of the absolute values of the eigenvalues of G. In this article we consider the problem whether generalized Fibonacci constants $varphi_n$ $(ngeq 2)$ can be the energy of graphs. We show that $varphi_n$ cannot be the energy of graphs. Also we prove that all natural powers of $varphi_{2n}$ cannot be the energy of a matroid.

متن کامل

Yangian, Truncated Yangian and Quantum Integrable Models

Based on the RTT relation for the given rational R-matrix the Yangian and truncated Yangian are discussed. The former can be used to generate the longrange interaction models, whereas the latter can be related to the GoryachevChaplygin(GC) gyrostat. The trigonometric extension of the Goryachev-Chaplygin gyrostat has also been shown.

متن کامل

On a Class of Knots with Fibonacci Invariant Numbers

This paper describes how a subclass of the rational knots* may be constructed sequentially., the knots in the sequence having 19 29 ..., i s ... crossings. For these knots, the values of a certain knot invariant are Fibonacci numbers, the i knot in the sequence having invariant number Fi . The knot invariant has a wide number of interpretations and properties, and some of these will be outlined...

متن کامل

Restricted Permutations, Fibonacci Numbers, and k-generalized Fibonacci Numbers

In 1985 Simion and Schmidt showed that the number of permutations in Sn which avoid 132, 213, and 123 is equal to the Fibonacci number Fn+1. We use generating function and bijective techniques to give other sets of pattern-avoiding permutations which can be enumerated in terms of Fibonacci or k-generalized Fibonacci numbers.

متن کامل

Fibonacci Numbers

One can prove the following three propositions: (1) For all natural numbers m, n holds gcd(m,n) = gcd(m, n + m). (2) For all natural numbers k, m, n such that gcd(k, m) = 1 holds gcd(k,m · n) = gcd(k, n). (3) For every real number s such that s > 0 there exists a natural number n such that n > 0 and 0 < 1 n and 1 n ¬ s. In this article we present several logical schemes. The scheme Fib Ind conc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Physics

سال: 2015

ISSN: 0003-4916

DOI: 10.1016/j.aop.2015.07.014